Step of Proof: choicef_wf
9,38
postcript
pdf
Inference at
*
1
1
1
1
I
of proof for Lemma
choicef
wf
:
1.
xm
:
P
:
.
P
(
P
)
2.
T
: Type
3.
P
:
T
4.
a
:
T
.
P
(
a
)
5.
y
: {
y
:
T
|
P
(
y
)}
False
6.
xm
({
y
:
T
|
P
(
y
)} ) = (inr
y
)
{
y
:
T
|
P
(
y
)}
latex
by ((((D 4)
CollapseTHEN (With
a
(D 0)))
)
CollapseTHEN ((Auto_aux (first_nat 1:n
C
) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
t
T
,
x
(
s
)
,
x
:
A
.
B
(
x
)
,
origin